Model Rute Perjalanan Minimal Dengan Menggunakan Vehicle Routing Problem Pada PT X
نویسندگان
چکیده
In this research discusses the problem of distributing goods from a depot to several customer locations minimize travel costs. The is solved by using Vehicle Routing Problem method. data used in secondary with 10 customers and one depot. aim form model that has been obtained determine optimal route based on formed. first step objective function problem, then constraints may occur. After formed, solution sought. total cost trip multiplying per kilometer distance traveled.
منابع مشابه
Multidimensi Pada Data Warehouse Dengan Menggunakan Rumus Kombinasi
Multidimensional in data warehouse is a compulsion and become the most important for information delivery, without multidimensional data warehouse is incomplete. Multidimensional give the able to analyze business measurement in many different ways. Multidimensional is also synonymous with online analytical processing (OLAP).
متن کاملValidasi data dengan menggunakan objek lookup pada borland delphi 7.0
s: Developing an application with some tables must concern the validation of input (scpecially in Table Child). In order to maximize the accuracy and input data validation. Its called lookup (took data from other dataset). There are 2 (two) ways to lookup data from Table Parent: 1) Using Objects (DBLookupComboBox & DBLookupListBox), or 2) Arranging The Properties Of Fields Data Type (shown by u...
متن کاملVehicle Routing Problem Vehicle Routing Problem
ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...
متن کاملVehicle Routing Problem: Meta-heuristic Approaches
The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknologi Dan Sistem Informasi Bisnis
سال: 2022
ISSN: ['2655-8238']
DOI: https://doi.org/10.47233/jteksis.v4i2.497